An Approximate Analysis of the Performance of Extendible Hashing with Elastic Buckets
نویسنده
چکیده
This paper extends the analysis of Extendible Hashing to cover Partial Expansions with elastic buckets. Although previous studies of elastic buckets can be adapted to extendible hashing, the approach taken here provides another view to the problem. We provide a correspondence between xed bucket capacities and elastic buckets. Furthermore, the results are based on easy and straightforward approximations.
منابع مشابه
Extendible Hashing
DEFINITION Extendible Hashing is a dynamically updateable disk-based index structure which implements a hashing scheme utilizing a directory. The index is used to support exact match queries, i.e. find the record with a given key. Compared with the B+-tree index which also supports exact match queries (in logarithmic number of I/Os), Extendible Hashing has better expected query cost O(1) I/O. C...
متن کاملEH* - Extendible Hashing in a Distributed Environment
In today’s world of computers, dealing with huge amounts of data is not unusual. The need to distribute this data in order to increase its availability and increase the performance of accessing it is more urgent than ever. For these reasons it is necessary to develop scalable distributed data structures. In this paper we propose EH , a distributedvariant of the Extendible Hashing data structure...
متن کاملL Linear Hashing
Linear Hashing is a dynamically updateable diskbased index structure which implements a hashing scheme and which grows or shrinks one bucket at a time. The index is used to support exact match queries, i.e., find the record with a given key. Compared with the BC-tree index which also supports exact match queries (in logarithmic number of I/Os), Linear Hashing has better expected query cost O(1)...
متن کاملLinear Hashing
DEFINITION Linear Hashing is a dynamically updateable disk-based index structure which implements a hashing scheme and which grows or shrinks one bucket at a time. The index is used to support exact match queries, i.e. find the record with a given key. Compared with the B+-tree index which also supports exact match queries (in logarithmic number of I/Os), Linear Hashing has better expected quer...
متن کاملHierarchical Grid Structures for Static Geographic Data Bases
Projects for the creation of large cartographic data bases and the advent of high volume optical disk technology create a need for structures for static mass data storage. This paper reviews existing approaches for structuring mass storage and proposes a scheme which combines the following concepts: a) separation of "background data" from "geographic object data"; b) use of hierarchical grid st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 48 شماره
صفحات -
تاریخ انتشار 1993